Program for Structure Refinements.

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Proving program refinements and transformations

In this thesis we develop a theory of program refinement and equivalence which can be used to develop practical tools for program development, analysis and modification. The theory is based on the use of general specifications and an imperative kernel language. We use weakest preconditions, expressed as formulae in infinitary logic to prove refinement and equivalence between programs. The kerne...

متن کامل

Program Families: Program Construction by Context Independent Refinements

The concept of program families is a generalisation of the conventional stepwise refinement paradigm. We formalise program families by allowing Hoare-triplets to be parameterized. Next WC derive a simple calculus to develop programs which are known a priori to bc correct with respect to explicitly formulated preand postconditions. Program families deal with at least two important problems of co...

متن کامل

Search for Program Structure

The community of programming language research loves the Curry-Howard correspondence between proofs and programs. Cut-elimination as computation, theorems for free, call/cc as excluded middle, dependently typed languages as proof assistants, etc. Yet we have, for all these years, missed an obvious observation: “the structure of programs corresponds to the structure of proof search”. For pure pr...

متن کامل

Refinements for Free!

Formal verification of algorithms often requires a choice between definitions that are easy to reason about and definitions that are computationally efficient. One way to reconcile both consists in adopting a high-level view when proving correctness and then refining stepwise down to an efficient low-level implementation. Some refinement steps are interesting, in the sense that they improve the...

متن کامل

SrRietveld: a program for automating Rietveld refinements for high-throughput powder diffraction studies

SrRietveld is a highly automated software toolkit for Rietveld refinement. Compared to traditional refinement programs, it is more efficient to use and easier to learn. It is designed for modern high-throughput diffractometers and is capable of processing large numbers of data sets with minimal effort. The software currently uses conventional Rietveld refinement engines, automating GSAS and Ful...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nihon Kessho Gakkaishi

سال: 1999

ISSN: 0369-4585,1884-5576

DOI: 10.5940/jcrsj.41.364